Minimum connected dominating sets and maximal independent sets in unit disk graphs
نویسندگان
چکیده
منابع مشابه
Minimum connected dominating sets and maximal independent sets in unit disk graphs
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the sizemis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G pl...
متن کاملNew approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Given a node-weighted graph, the minimum-weighted dominating set (MWDS) problem is to find a minimum-weighted vertex subset such that, for any vertex, it is contained in this subset or it has a neighbor contained in this set. And the minimum-weighted connected dominating set (MWCDS) problem is to find a MWDS such that the graph induced by this subset is connected. In this paper, we study these ...
متن کاملLinear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their application in wireless ad-hoc networks. Since the minimum dominating set problem for unit disk graphs is NP-hard, several approximation algorithms with different merits have been proposed in the literature. On one extreme, there is a linear time 5-a...
متن کاملConstant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph is contained in the subset or has a neighbor in the subset. A unit disk graph is a graph in which each vertex corresponds to a unit disk in the plane and two vertices are adjacent if and only if their disks have a non...
متن کاملLocal Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
Many protocols in distributed computing make use of dominating and connected dominating sets, for example for broadcasting and the computation of routing. Ad hoc networks impose an additional requirement that algorithms for the construction of such sets should be local in the sense that each node of the network should make decisions based only on the information obtained from nodes located a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.08.037